Comparison Between Lamarckian and Baldwinian Repair on Multiobjective 0/1 Knapsack Problems
نویسندگان
چکیده
This paper examines two repair schemes (i.e., Lamarckian and Baldwinian) through computational experiments on multiobjective 0/1 knapsack problems. First we compare Lamarckian and Baldwinian with each other. Experimental results show that the Baldwinian repair outperforms the Lamarckian repair. It is also shown that these repair schemes outperform a penalty function approach. Then we examine partial Lamarckianism where the Lamarckian repair is applied to each individual with a prespecified probability. Experimental results show that a so-called 5% rule works well. Finally partial Lamarckianism is compared with an island model with two subpopulations where each island has a different repair scheme. Experimental results show that the island model slightly outperforms the standard single-population model with the 50% partial Lamarckian repair in terms of the diversity of solutions.
منابع مشابه
Lamarckian Repair and Darwinian Repair in EMO Algorithms for Multiobjective 0/1 Knapsack Problems
Multiobjective 0/1 knapsack problems have been frequently used as test problems to examine the performance of evolutionary multiobjective optimization algorithms in the literature. It has been reported that their performance strongly depends on the choice of a constraint handling method. In this paper, we examine two implementation schemes of greedy repair: Lamarckian and Darwinian. In the Lama...
متن کاملImproving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using ϵ -dominance
The 0/1 knapsack problem is a well known problem occurring in many real world problems. The problem is NP-Complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. A new evolutionary algorithm for solving multiobjective 0/1 knapsack problem is proposed in this paper. This algorithm used a ε-dominance relation fo...
متن کاملMOEA/D with Uniform Design for Solving Multiobjective Knapsack Problems
The 0/1 knapsack problem is a well-known problem, which appears in many real domains with practical importance. The problem is NP-complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. Many algorithms have been proposed in the past five decades for both single and multiobjective knapsack problems. A new versi...
متن کاملA hybrid genetic/immune strategy to tackle the multiobjective quadratic assignment problem
The Genetic Immune Strategy for Multiple Objective Optimization (GISMOO) is a hybrid algorithm for solving multiobjective problems. The performance of this approach has been assessed using a classical combinatorial multiobjective optimization benchmark: the multiobjective 0/1 knapsack problem (MOKP) [1] and two-dimensional unconstrained multiobjective problems (ZDT) [2]. This paper shows that t...
متن کاملM-PAES: A Memetic Algorithm for Multiobjective Optimization
A memetic algorithm for tackling multiobjective optimization problems is presented. The algorithm employs the proven local search strategy used in the Pareto archived evolution strategy (PAES) and combines it with the use of a population and recombination. Verification of the new algorithm is carried out by testing it on a set of multiobjective 0/1 knapsack problems. On each problem instance, c...
متن کامل